Directed Overlap-inclusion Graphs as Representations of Ciliate Genes
نویسندگان
چکیده
Ciliates form a large and old group of unicellular eukaryotes. One of their characteristics is that each ciliate contains two types of functionally different nuclei: the germline nuclei (micronuclei) and the somatic nuclei (the macronuclei), each having multiple copies. The genes are differently organized in the two types of nuclei: micronuclear genes are split into blocks (called MDSs), which are separated by noncoding blocks. The MDSs come in a shuffled order, some of them being also inverted. Each MDS M ends with a short sequence of nucleotides (called pointer) that has a second occurrence in the beginning of the MDS that should follow M in the orthodox order. Macronuclear genes have all the MDSs spliced together (or assembled) on their common pointers. During sexual reproduction, all macronuclei are destroyed and new macronuclei are formed starting from a copy of a micronucleus. During this process, micronuclear genes get transformed into macronuclear genes by having excised all noncoding blocks and assembling the MDSs in the orthodox order. The process is called gene assembly and has been subject to intense combinatorial and computational research in the last decade. We refer for details to [6], [1], and [23] and references therein. Several molecular models were considered for the gene assembly process, see [1]. Among them is the simple intramolecular model introduced in [8]. Unlike the other models, the simple intramolecular model postulates that gene assembly takes place as a result of local interactions, where only neighboring MDSs are able to interact with each other. The model was shown in [15] to predict correctly the assembly of all currently known gene patterns, see the database discussed in [5] for an up-to-date list. The simple model was modeled mathematically as a sorting of signed permutations in [16], and as a string rewriting system in [3, 4]. Both formal frameworks turned out to be limited in capturing the details of the local interactions postulated by the simple model and made it difficult to characterize, e.g., all gene patterns that can be assembled through simple operations. A similar difficulty in the case of the general intramolecular model was overcome by extending the model to signed overlap graphs, see [6]. In
منابع مشابه
Graph Based Analysis for Gene Segment Organization In a Scrambled Genome
ABSTRACT. DNA rearrangement processes recombine gene segments that are organized on the chromosome in a variety of ways. The segments can overlap, interleave or one may be a subsegment of another. We use directed graphs to represent segment organizations on a given locus where contigs containing rearranged segments represent vertices and the edges correspond to the segment relationships. Using ...
متن کاملOn-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations
The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs with geometric representations and competitive analysis of on-line algorithms, which became apparent after the recent construction of triangle-free geometric intersection graphs with arbitrarily large chromatic number due to Pawlik et al. We show that on-line graph coloring problems give ...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملOn independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملTwin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 110 شماره
صفحات -
تاریخ انتشار 2011